Efficient Personalized Pagerank Computation: A Survey
نویسندگان
چکیده
منابع مشابه
Efficient Computation of PageRank
This paper discusses efficient techniques for computing PageRank, a ranking metric for hypertext documents. We show that PageRank can be computed for very large subgraphs of the web (up to hundreds of millions of nodes) on machines with limited main memory. Running-time measurements on various memory configurations are presented for PageRank computation over the 24-million-page Stanford WebBase...
متن کاملEfficient Algorithms for Personalized PageRank
We present new, more efficient algorithms for estimating random walk scores such as Personalized PageRank from a given source node to one or several target nodes. These scores are useful for personalized search and recommendations on networks including social networks, user-item networks, and the web. Past work has proposed using Monte Carlo or using linear algebra to estimate scores from a sin...
متن کاملEfficient Parallel Computation of PageRank
PageRank inherently is massively parallelizable and distributable, as a result of web’s strict host-based link locality. We show that the Gauß-Seidel iterative method can actually be applied in such a parallel ranking scenario in order to improve convergence. By introducing a two-dimensional web model and by adapting the PageRank to this environment, we present efficient methods to compute the ...
متن کاملAn Overview of Efficient Computation of PageRank
With the rapid growth of the Web, users get easily lost in the rich hyper structure. Providing relevant information to the users to cater to their needs is the primary goal of website owners. Therefore, finding the content of the Web and retrieving the users’ interests and needs from their behavior have become increasingly important. Web mining is used to categorize users and pages by analyzing...
متن کاملEfficient Personalized PageRank Estimation for Many Sources and Many Targets
Personalized PageRank (PPR) is a measure of the importance of a node in a graph from the perspective of another node (we call these nodes the target and the source, respectively). PPR has been used in many applications, such as offering a Twitter user (the source) personalized recommendations of who to follow (targets deemed important by PPR). Computing PPR at scale is infeasible for networks l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2013
ISSN: 1812-5654
DOI: 10.3923/jas.2013.4892.4896